Performance Evaluation of Load-Balanced Routing via Bounded Randomization
نویسندگان
چکیده
منابع مشابه
Performance Evaluation of Load-Balanced Routing via Bounded Randomization
Future computer networks are expected to carry bursty traffic. Shortest-path routing protocols such as OSPF and RIP have the disadvantage of causing bottlenecks due to their inherent single-path routing. That is, the uniformly selected shortest path between a source and a destination may become highly congested even when many other paths have low utilization. We propose a family of routing sche...
متن کاملHierarchical load-balanced routing via bounded randomization
The purpose of routing protocols in a computer network is to maximize network throughput. Popular shortest-path routing protocols have the disadvantage of causing bottlenecks due to their single-path routing. That is, the shortest path between a source and a destination may become highly congested even when many other paths have low utilization. In this paper, we propose a routing scheme for hi...
متن کاملLoad-Balanced Routing via Bounded Randomization
Future computer networks are expected to carry bursty traffic. Shortest-path routing protocols have the disadvantage of causing bottlenecks due to their single-path routing. That is, the shortest path between a source and a destination may become highly congested even when many other paths have low utilization. We propose a routing scheme that distributes traffic over the whole network via boun...
متن کاملPerformance Evaluation of Load-Balanced Clustering of Wireless Sensor Networks
Wireless sensor networks have received increasing attention in the recent few years. In many military and civil applications of sensor networks, sensors are constrained in onboard energy supply and are left unattended. Energy, size and cost constraints of such sensors limit their communication range. Therefore, they require multi-hop wireless connectivity to forward data on their behalf to a re...
متن کاملLoad-Balanced Anycast Routing in Computer Networks
We present a practical approach to routing and anycasting with near-optimum delays taking into account the processing loads at routers and processing elements of a computer network. To accomplish this, the minimum-delay routing problem formulated by Gallager is generalized into the problem of minimum-delay routing with load-balancing to account for processing delays in network nodes (servers an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: CLEI Electronic Journal
سال: 2000
ISSN: 0717-5000
DOI: 10.19153/cleiej.3.2.1